height balanced

См. также в других словарях:

• Balanced flow — In atmospheric science, balanced flow is an idealisation of atmospheric motion. The idealisation consists in considering the behaviour of one isolated parcel of air having constant density, its motion on a horizontal plane subject to selected… …   Wikipedia

• Balanced field takeoff — In aviation, the balanced field takeoff is the theoretical principle whereby the critical engine failure recognition speed, or V1, is used as a decision speed at which the pilot elects whether to continue the takeoff. The concept at play is that …   Wikipedia

• AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… …   Wikipedia

• Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… …   Wikipedia

• Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

• Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

• GiST — In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk based search trees. GiST is a generalization of the B+ tree, providing a concurrent and recoverable height balanced search tree …   Wikipedia

• Árbol 2-3 — Este artículo o sección sobre informática necesita ser wikificado con un formato acorde a las convenciones de estilo. Por favor, edítalo para que las cumpla. Mientras tanto, no elimines este aviso puesto el 2 de febrero de 2009. También puedes… …   Wikipedia Español

• сбалансированное по высоте дерево — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN height balanced tree …   Справочник технического переводчика